// DRBT changes here

/* -*-	Mode:C++; c-basic-offset:8; tab-width:8; indent-tabs-mode:t -*- */
/*
 * Copyright (c) 1994 Regents of the University of California.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *	This product includes software developed by the Computer Systems
 *	Engineering Group at Lawrence Berkeley Laboratory.
 * 4. Neither the name of the University nor of the Laboratory may be used
 *    to endorse or promote products derived from this software without
 *    specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#ifndef lint
static const char rcsid[] =
    "@(#) $Header: /cvsroot/nsnam/ns-2/queue/drop-tail.cc,v 1.17 2004/10/28 23:35:37 haldar Exp $ (LBL)";
#endif

#include "drop-tail.h"
// 1. DRBT
#include <stdio.h>
#include <stdlib.h>

#define CURRENT_TIME    Scheduler::instance().clock()
#define TU_SECONDS 0
#define TU_USECONDS 10000000
// end 1

static class DropTailClass : public TclClass {
 public:
	DropTailClass() : TclClass("Queue/DropTail") {}
	TclObject* create(int, const char*const*) {
		return (new DropTail);
	}
} class_drop_tail;

void DropTail::reset()
{
	Queue::reset();
}

int 
DropTail::command(int argc, const char*const* argv) 
{
	// 2. DRBT
		length_s_be = 0;
		length_e_be = 0;
		qlim_be = qlim_;
		dyn_seuil = 1;
		// end 2
	if (argc==2) {
		if (strcmp(argv[1], "printstats") == 0) {
			print_summarystats();
			return (TCL_OK);
		}
 		if (strcmp(argv[1], "shrink-queue") == 0) {
 			shrink_queue();
 			return (TCL_OK);
 		}
	}
	if (argc == 3) {
		if (!strcmp(argv[1], "packetqueue-attach")) {
			delete q_;
			if (!(q_ = (PacketQueue*) TclObject::lookup(argv[2])))
				return (TCL_ERROR);
			else {
				pq_ = q_;
				return (TCL_OK);
			}
		}
	}
	return Queue::command(argc, argv);
}

// 3. DRBT
DropTail::DropTail() :
	timer_(this) {

	test = false;
	TimerExpire = false;
	priqueue = 0;
	bplibre = 0;

	q_ = new PacketQueue;
	pq_ = q_;

	bind_bool("drop_front_", &drop_front_);
	bind_bool("summarystats_", &summarystats);
	bind_bool("queue_in_bytes_", &qib_); // boolean: q in bytes?
	bind("mean_pktsize_", &mean_pktsize_);
	//              _RENAMED("drop-front_", "drop_front_");


}

void DropTail::timeout() {

	//printf("DropTail : Timeout expired at %f\n",CURRENT_TIME);
	TimerExpire = true;
}

void QTimer::handle(Event *e) {

	a_->timeout();
	Scheduler::instance().schedule(this, &intr, 1.0);
}

/*
 * drop-tail
 */
void DropTail::enque(Packet* p) {
	struct hdr_ip* ih = HDR_IP(p);

	if (priqueue==1) {
		printf("Droptail: RECV FALSE RREP %f\n",bplibre);
		printf("Droptail: Bande Passante BE %f\n",bpBE);
		printf("Droptail: Nombre de Flux BE dans mon voisinage %d\n",nbFlux_be);   
		if ((bpBE)<=(bplibre/nbFlux_be)) {
			qlim_be = 1000;//qlim_;
			dyn_seuil = -1;
		} else {
			//dyn_seuil = ((bpBE)/(bplibre/nbFlux_be)) + 1;
			dyn_seuil = ((bpBE)/(699/nbFlux_be))+1;
			printf("Minh test 1 SEUIL=%d\n", dyn_seuil);			
		}

		printf("SEUIL %d\n", dyn_seuil);
		if (dyn_seuil == 0)
			dyn_seuil = 100;
		priqueue = 0;
	}

	if (!test) {
		timer_.handle((Event *) 0);
		test = true;
	}

	if (summarystats) {
		Queue::updateStats(qib_ ? q_->byteLength() : q_->length());
	}

	int qlimBytes = qlim_ * mean_pktsize_;
	/******************** QoS ***************/
//	printf("Size: %d\n", hdr_cmn::access(p)->size());
	if (ih->fid_ != 1) {
		if ((!qib_ && (q_->length() + 1) >= qlim_) || (qib_
				&& (q_->byteLength() + hdr_cmn::access(p)->size()) >= qlimBytes)) {
			// if the queue would overflow if we added this packet...
			if (drop_front_) { /* remove from head of queue */				
				Packet *pp = q_->deque();
				drop(pp);
				q_->enque(p);
			} else {
				drop(p);
			}
		} else {
			q_->enque(p);
		}
		//printf("DANG O TRONG QoS\n");
		//printf("QoS test : E %d qlim_ %d S %d\n", length_e_be, qlim_, length_s_be);
	}
	/****************** Best Effort ***********************/
	else {
		//if ((!qib_ && (q_->length() + 1) >= qlim_) ||
		//printf("length_s_be %d\n",length_s_be);
		length_e_be++;
		if (TimerExpire) {
			if (dyn_seuil != -1)
				qlim_be = length_e_be/dyn_seuil;
			printf("TIMER EXPIRATION : E %d E/2 %d S %d %f \n",length_e_be,qlim_be,length_s_be,CURRENT_TIME);
			length_s_be = 0;
			length_e_be = 0;
			TimerExpire = false;
		}

		//printf("Minh test 2: Seuil=%d E %d E/2 %d S %d \n",dyn_seuil, length_e_be,qlim_be,length_s_be);

		if ((!qib_ && (length_s_be + 1) >= qlim_be) || (qib_
				&& (q_->byteLength() + hdr_cmn::access(p)->size()) >= qlimBytes)) {

			// if the queue would overflow if we added this packet...
			if (drop_front_) { /* remove from head of queue */				
				Packet *pp = q_->deque();
				drop(pp);
				q_->enque(p);
			} else {
				drop(p);
			}
		} else {
			length_s_be++;
			q_->enque(p);
		}
	}
}
// end 3
/*
 * drop-tail
 */

/*void DropTail::enque(Packet* p)
{
	if (summarystats) {
                Queue::updateStats(qib_?q_->byteLength():q_->length());
	}

	int qlimBytes = qlim_ * mean_pktsize_;
	if ((!qib_ && (q_->length() + 1) >= qlim_) ||
  	(qib_ && (q_->byteLength() + hdr_cmn::access(p)->size()) >= qlimBytes)){
		// if the queue would overflow if we added this packet...
		if (drop_front_) {  remove from head of queue 
			q_->enque(p);
			Packet *pp = q_->deque();
			drop(pp);
		} else {
			drop(p);
		}
	} else {
		q_->enque(p);
	}
}
*/
//AG if queue size changes, we drop excessive packets...
void DropTail::shrink_queue() 
{
        int qlimBytes = qlim_ * mean_pktsize_;
	if (debug_)
		printf("shrink-queue: time %5.2f qlen %d, qlim %d\n",
 			Scheduler::instance().clock(),
			q_->length(), qlim_);
        while ((!qib_ && q_->length() > qlim_) || 
            (qib_ && q_->byteLength() > qlimBytes)) {
                if (drop_front_) { /* remove from head of queue */
                        Packet *pp = q_->deque();
                        drop(pp);
                } else {
                        Packet *pp = q_->tail();
                        q_->remove(pp);
                        drop(pp);
                }
        }
}

Packet* DropTail::deque()
{
        if (summarystats && &Scheduler::instance() != NULL) {
                Queue::updateStats(qib_?q_->byteLength():q_->length());
        }
	return q_->deque();
}

void DropTail::print_summarystats()
{
	//double now = Scheduler::instance().clock();
        printf("True average queue: %5.3f", true_ave_);
        if (qib_)
                printf(" (in bytes)");
        printf(" time: %5.3f\n", total_time_);
}
